Simulation refinement for concurrency verification

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simulation Refinement for Concurrency Verification

In recent years, we extended the theory of Abadi and Lamport (1991) on the existence of refinement mappings. The present paper gives an overview of several extensions of the theory and of a number of recent applications to practical verifications. It concludes with a sketch of the results on semantic completeness, and a discussion of the relationship between semantic completeness and methodolog...

متن کامل

Data refinement for true concurrency

The majority of modern systems exhibit sophisticated concurrent behaviour, where several system components modify and observe the system state with fine-grained atomicity. Many systems (e.g., multi-core processors, real-time controllers) also exhibit truly concurrent behaviour, where multiple events can occur simultaneously. This paper presents data refinement defined in terms of an interval-ba...

متن کامل

Variable Permissions for Concurrency Verification

In the multicore era, verification for concurrent programs is increasingly important. Although state-of-the-art verification systems ensure safe concurrent accesses to heap data structures, they tend to ignore program variables. This is problematic since these variables might also be accessed by concurrent threads. One solution is to apply the same permission system, designed for heap memory, t...

متن کامل

Theory Refinement for Program Verification

Recent progress in automated formal verification is to a large degree due to the development of constraint languages that are sufficiently light-weight for reasoning but still expressive enough to prove properties of programs. Satisfiability modulo theories (SMT) solvers implement efficient decision procedures, but offer little direct support for adapting the constraint language to the task at ...

متن کامل

Graph Transformation for Verification and Concurrency

The talk will begin with a brief introduction to Rewriting Logic and use of the Maude language. A case study based on modeling security aspects a remote service toolkit will be used to illustrate the approach to formal modeling and analysis in more detail. Preprint submitted to Elsevier Preprint 1 Graph Transformation for Verification and Concurrency (pre-proceedings) CTIT Technical Report 05-3...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Science of Computer Programming

سال: 2011

ISSN: 0167-6423

DOI: 10.1016/j.scico.2009.09.006